A modeless convex hull algorithm for simple polygons
نویسندگان
چکیده
We present an order n algorithm which computes the convex hull of a two-dimensional non-selfintersecting polygon. The algorithm recovers much of the simplicity of the one presented by Sklansky (Sklansky, 1972), and subsequently disproved. Unlike several algorithms which have been found since then, the modified algorithm executes a truly uniform (modeless) traversal of all the vertices of the polygon. This makes it possible to extend the algorithm to extract geometric information about the interior of the polygon.
منابع مشابه
CS 157 : Assignment 6 Douglas R . Lanman 8 May 2006 Problem 1 : Evaluating Convex Polygons
Problem 1: Evaluating Convex Polygons This write-up presents several simple algorithms for determining whether a given set of twodimensional points defines a convex polygon (i.e., a convex hull). In Section 1.1, we introduce the notion of regular polygons and provide examples of both convex and non-convex point sets. Section 1.2 presents an algorithm for ordering a set of points such that a cou...
متن کاملOuter common tangents and nesting of convex hulls of two disjoint simple polygons in linear time and constant workspace
We describe an algorithm for computing the outer common tangents of two disjoint simple polygons using linear time and only constant workspace. A tangent of a polygon is a line touching the polygon such that all of the polygon lies on the same side of the line. An outer common tangent of two polygons is a tangent of both polygons such that the polygons lie on the same side of the tangent. Each ...
متن کاملRecursive computation of minimum-length polygons
The relative convex hull, or the minimum-perimeter polygon (MPP) of a simple polygon A, contained in a second polygon B, is a unique polygon in the set of nested polygons between A and B. The computation of the minimum-length polygon (MLP), as a special case for isothetic polygons A and B, is useful for various applications in image analysis and robotics. The paper discusses the first recursive...
متن کاملSolving Geometric Problems with the Rotating Calipers *
Shamos [1] recently showed that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several sets of calipers can be used simultaneously on one convex polygon, or one set of calipers can be us...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کامل